struct AT POS:0
ID(node) AT POS:7
{ AT POS:12
int AT POS:16
ID(data) AT POS:20
; AT POS:24
struct AT POS:28
ID(node) AT POS:35
* AT POS:39
ID(next) AT POS:40
; AT POS:44
} AT POS:46
; AT POS:47
void AT POS:49
ID(insert) AT POS:54
( AT POS:60
struct AT POS:61
ID(node) AT POS:68
* AT POS:72
* AT POS:73
ID(p) AT POS:74
, AT POS:75
int AT POS:76
ID(num) AT POS:80
) AT POS:83
{ AT POS:85
struct AT POS:89
ID(node) AT POS:96
* AT POS:100
ID(temp) AT POS:101
; AT POS:105
if AT POS:109
( AT POS:111
* AT POS:112
ID(p) AT POS:113
== AT POS:114
ID(NULL) AT POS:116
) AT POS:120
{ AT POS:126
( AT POS:134
* AT POS:135
ID(p) AT POS:136
) AT POS:137
= AT POS:138
( AT POS:139
struct AT POS:140
ID(node) AT POS:147
* AT POS:151
) AT POS:152
ID(malloc) AT POS:153
( AT POS:159
ID(sizeof) AT POS:160
( AT POS:166
struct AT POS:167
ID(node) AT POS:174
) AT POS:178
) AT POS:179
; AT POS:180
( AT POS:188
* AT POS:189
ID(p) AT POS:190
) AT POS:191
-> AT POS:192
ID(next) AT POS:194
= AT POS:198
ID(NULL) AT POS:199
; AT POS:203
( AT POS:211
* AT POS:212
ID(p) AT POS:213
) AT POS:214
-> AT POS:215
ID(data) AT POS:217
= AT POS:221
ID(num) AT POS:222
; AT POS:225
} AT POS:231
else AT POS:235
{ AT POS:244
ID(temp) AT POS:252
= AT POS:256
( AT POS:257
struct AT POS:258
ID(node) AT POS:265
* AT POS:269
) AT POS:270
ID(malloc) AT POS:271
( AT POS:277
ID(sizeof) AT POS:278
( AT POS:284
struct AT POS:285
ID(node) AT POS:292
) AT POS:296
) AT POS:297
; AT POS:298
ID(temp) AT POS:306
-> AT POS:310
ID(next) AT POS:312
= AT POS:316
( AT POS:317
* AT POS:318
ID(p) AT POS:319
) AT POS:320
; AT POS:321
( AT POS:329
* AT POS:330
ID(p) AT POS:331
) AT POS:332
= AT POS:333
ID(temp) AT POS:334
; AT POS:338
( AT POS:346
* AT POS:347
ID(p) AT POS:348
) AT POS:349
-> AT POS:350
ID(data) AT POS:352
= AT POS:356
ID(num) AT POS:357
; AT POS:360
} AT POS:366
} AT POS:368
void AT POS:372
ID(add_in) AT POS:377
( AT POS:383
struct AT POS:384
ID(node) AT POS:391
* AT POS:395
ID(a) AT POS:396
, AT POS:397
struct AT POS:398
ID(node) AT POS:405
* AT POS:409
ID(b) AT POS:410
, AT POS:411
struct AT POS:412
ID(node) AT POS:419
* AT POS:423
* AT POS:424
ID(c) AT POS:425
) AT POS:426
{ AT POS:428
int AT POS:432
ID(d) AT POS:436
, AT POS:437
ID(carry) AT POS:438
; AT POS:443
ID(carry) AT POS:447
= AT POS:452
INT(0) AT POS:453
; AT POS:454
struct AT POS:458
ID(node) AT POS:465
* AT POS:469
ID(t) AT POS:470
; AT POS:471
while AT POS:475
( AT POS:480
ID(a) AT POS:481
!= AT POS:482
ID(NULL) AT POS:484
&& AT POS:488
ID(b) AT POS:490
!= AT POS:491
ID(NULL) AT POS:493
) AT POS:497
{ AT POS:503
ID(d) AT POS:511
= AT POS:512
( AT POS:513
ID(a) AT POS:514
-> AT POS:515
ID(data) AT POS:517
+ AT POS:521
ID(b) AT POS:522
-> AT POS:523
ID(data) AT POS:525
+ AT POS:529
ID(carry) AT POS:530
) AT POS:535
/ AT POS:536
INT(10) AT POS:537
; AT POS:539
ID(insert) AT POS:547
( AT POS:553
ID(c) AT POS:554
, AT POS:555
ID(d) AT POS:556
) AT POS:557
; AT POS:558
if AT POS:566
( AT POS:568
( AT POS:570
ID(a) AT POS:571
-> AT POS:572
ID(data) AT POS:574
+ AT POS:578
ID(b) AT POS:579
-> AT POS:580
ID(data) AT POS:582
+ AT POS:586
ID(carry) AT POS:587
) AT POS:592
>= AT POS:594
INT(10) AT POS:597
) AT POS:599
{ AT POS:602
ID(carry) AT POS:607
= AT POS:612
INT(1) AT POS:613
; AT POS:614
} AT POS:617
else AT POS:625
ID(carry) AT POS:630
= AT POS:635
INT(0) AT POS:636
; AT POS:637
ID(a) AT POS:645
= AT POS:646
ID(a) AT POS:647
-> AT POS:648
ID(next) AT POS:650
; AT POS:654
ID(b) AT POS:662
= AT POS:663
ID(b) AT POS:664
-> AT POS:665
ID(next) AT POS:667
; AT POS:671
} AT POS:677
if AT POS:681
( AT POS:683
ID(a) AT POS:684
== AT POS:685
ID(NULL) AT POS:687
&& AT POS:691
ID(b) AT POS:693
== AT POS:694
ID(NULL) AT POS:696
) AT POS:700
{ AT POS:706
return AT POS:714
; AT POS:720
} AT POS:726
else AT POS:730
{ AT POS:739
if AT POS:747
( AT POS:749
ID(a) AT POS:750
!= AT POS:751
ID(NULL) AT POS:753
&& AT POS:757
ID(b) AT POS:759
== AT POS:760
ID(NULL) AT POS:762
) AT POS:766
{ AT POS:769
ID(t) AT POS:774
= AT POS:775
ID(a) AT POS:776
; AT POS:777
} AT POS:780
else AT POS:788
{ AT POS:794
ID(t) AT POS:799
= AT POS:800
ID(b) AT POS:801
; AT POS:802
} AT POS:805
while AT POS:813
( AT POS:818
ID(t) AT POS:819
!= AT POS:820
ID(NULL) AT POS:822
) AT POS:826
{ AT POS:829
ID(d) AT POS:834
= AT POS:835
( AT POS:836
ID(carry) AT POS:837
+ AT POS:842
ID(t) AT POS:843
-> AT POS:844
ID(data) AT POS:846
) AT POS:850
/ AT POS:851
INT(10) AT POS:852
; AT POS:854
if AT POS:859
( AT POS:861
( AT POS:862
ID(carry) AT POS:863
+ AT POS:868
ID(t) AT POS:869
-> AT POS:870
ID(data) AT POS:872
) AT POS:876
>= AT POS:877
INT(10) AT POS:879
) AT POS:881
ID(carry) AT POS:888
= AT POS:893
INT(1) AT POS:894
; AT POS:895
else AT POS:900
ID(carry) AT POS:910
= AT POS:915
INT(0) AT POS:916
; AT POS:917
ID(insert) AT POS:922
( AT POS:928
ID(c) AT POS:929
, AT POS:930
ID(d) AT POS:931
) AT POS:932
; AT POS:933
ID(t) AT POS:938
= AT POS:939
ID(t) AT POS:940
-> AT POS:941
ID(next) AT POS:943
; AT POS:947
} AT POS:950
if AT POS:958
( AT POS:960
ID(carry) AT POS:961
== AT POS:966
INT(1) AT POS:968
) AT POS:969
ID(insert) AT POS:972
( AT POS:978
ID(c) AT POS:979
, AT POS:980
ID(carry) AT POS:981
) AT POS:986
; AT POS:987
} AT POS:993
} AT POS:995
void AT POS:997
ID(numin) AT POS:1002
( AT POS:1007
struct AT POS:1008
ID(node) AT POS:1015
* AT POS:1019
* AT POS:1020
ID(p) AT POS:1021
) AT POS:1022
{ AT POS:1024
* AT POS:1028
ID(p) AT POS:1029
= AT POS:1030
ID(NULL) AT POS:1031
; AT POS:1035
char AT POS:1036
ID(c) AT POS:1041
= AT POS:1042
STRING("c") AT POS:1043
; AT POS:1046
while AT POS:1050
( AT POS:1055
ID(c) AT POS:1056
!= AT POS:1057
STRING("n") AT POS:1059
) AT POS:1062
{ AT POS:1068
ID(c) AT POS:1076
= AT POS:1077
ID(getch) AT POS:1078
( AT POS:1083
) AT POS:1084
; AT POS:1085
if AT POS:1093
( AT POS:1095
! AT POS:1096
ID(isdigit) AT POS:1097
( AT POS:1104
ID(c) AT POS:1105
) AT POS:1106
) AT POS:1107
return AT POS:1110
; AT POS:1116
else AT POS:1124
{ AT POS:1130
ID(putch) AT POS:1135
( AT POS:1140
ID(c) AT POS:1141
) AT POS:1142
; AT POS:1143
ID(insert) AT POS:1148
( AT POS:1154
ID(p) AT POS:1155
, AT POS:1156
ID(c) AT POS:1157
- AT POS:1158
STRING("0") AT POS:1159
) AT POS:1162
; AT POS:1163
} AT POS:1166
} AT POS:1172
} AT POS:1174
void AT POS:1176
ID(disp) AT POS:1181
( AT POS:1185
struct AT POS:1186
ID(node) AT POS:1193
* AT POS:1197
ID(p) AT POS:1198
) AT POS:1199
{ AT POS:1201
if AT POS:1205
( AT POS:1207
ID(p) AT POS:1208
== AT POS:1209
ID(NULL) AT POS:1211
) AT POS:1215
return AT POS:1221
; AT POS:1227
else AT POS:1231
{ AT POS:1240
ID(printf) AT POS:1248
( AT POS:1254
STRING("%d") AT POS:1255
, AT POS:1259
ID(p) AT POS:1260
-> AT POS:1261
ID(data) AT POS:1263
) AT POS:1267
; AT POS:1268
ID(disp) AT POS:1276
( AT POS:1280
ID(p) AT POS:1281
-> AT POS:1282
ID(next) AT POS:1284
) AT POS:1288
; AT POS:1289
} AT POS:1295
} AT POS:1298
void AT POS:1300
ID(main) AT POS:1305
( AT POS:1309
) AT POS:1310
{ AT POS:1312
struct AT POS:1316
ID(node) AT POS:1323
* AT POS:1328
ID(a) AT POS:1329
, AT POS:1330
* AT POS:1331
ID(b) AT POS:1332
, AT POS:1333
* AT POS:1334
ID(c) AT POS:1335
; AT POS:1336
ID(clrscr) AT POS:1340
( AT POS:1346
) AT POS:1347
; AT POS:1348
ID(a) AT POS:1352
= AT POS:1353
ID(b) AT POS:1354
= AT POS:1355
ID(c) AT POS:1356
= AT POS:1357
ID(NULL) AT POS:1358
; AT POS:1362
ID(printf) AT POS:1366
( AT POS:1372
STRING("Enter the first number....") AT POS:1373
) AT POS:1401
; AT POS:1402
ID(numin) AT POS:1406
( AT POS:1411
ID(a) AT POS:1412
) AT POS:1413
; AT POS:1414
ID(printf) AT POS:1418
( AT POS:1424
STRING("Enter the second number....") AT POS:1425
) AT POS:1454
; AT POS:1455
ID(numin) AT POS:1459
( AT POS:1464
ID(b) AT POS:1465
) AT POS:1466
; AT POS:1467
ID(printf) AT POS:1471
( AT POS:1477
STRING("The added result is...") AT POS:1478
) AT POS:1502
; AT POS:1503
ID(add_in) AT POS:1507
( AT POS:1513
ID(a) AT POS:1514
, AT POS:1515
ID(b) AT POS:1516
, AT POS:1517
ID(c) AT POS:1518
) AT POS:1519
; AT POS:1520
ID(disp) AT POS:1524
( AT POS:1528
ID(c) AT POS:1529
) AT POS:1530
; AT POS:1531
ID(getch) AT POS:1535
( AT POS:1540
) AT POS:1541
; AT POS:1542
} AT POS:1544

